0.06/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.14	% Command    : run_E %s %d THM
0.14/0.34	% Computer : n017.cluster.edu
0.14/0.34	% Model    : x86_64 x86_64
0.14/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory   : 8042.1875MB
0.14/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 960
0.14/0.35	% WCLimit    : 120
0.14/0.35	% DateTime   : Tue Aug  9 01:53:45 EDT 2022
0.14/0.35	% CPUTime    : 
0.20/0.47	Running higher-order on 8 cores theorem proving
0.20/0.47	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.47	# Version: 3.0pre003-ho
0.20/0.48	# Preprocessing class: HSSSSMSSSSSNHHA.
0.20/0.48	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting sh2lt with 480s (4) cores
0.20/0.48	# Starting new_ho_10_unif with 120s (1) cores
0.20/0.48	# Starting full_lambda_6 with 120s (1) cores
0.20/0.48	# Starting post_as_ho1 with 120s (1) cores
0.20/0.48	# Starting ehoh_best3_rw with 120s (1) cores
0.20/0.48	# new_ho_10_unif with pid 6376 completed with status 0
0.20/0.48	# Result found by new_ho_10_unif
0.20/0.48	# Preprocessing class: HSSSSMSSSSSNHHA.
0.20/0.48	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting sh2lt with 480s (4) cores
0.20/0.48	# Starting new_ho_10_unif with 120s (1) cores
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Search class: HGHNF-FFSF11-SHHFFMBN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting ehoh_best_nonlift with 65s (1) cores
0.20/0.48	# ehoh_best_nonlift with pid 6381 completed with status 0
0.20/0.48	# Result found by ehoh_best_nonlift
0.20/0.48	# Preprocessing class: HSSSSMSSSSSNHHA.
0.20/0.48	# Scheduled 5 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting sh2lt with 480s (4) cores
0.20/0.48	# Starting new_ho_10_unif with 120s (1) cores
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Search class: HGHNF-FFSF11-SHHFFMBN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting ehoh_best_nonlift with 65s (1) cores
0.20/0.48	# Preprocessing time       : 0.001 s
0.20/0.48	# Presaturation interreduction done
0.20/0.48	
0.20/0.48	# Proof found!
0.20/0.48	# SZS status Theorem
0.20/0.48	# SZS output start CNFRefutation
0.20/0.48	thf(decl_22, type, cN: $i > $i).
0.20/0.48	thf(decl_23, type, cM: $i > $i).
0.20/0.48	thf(decl_24, type, epred1_0: ($i > $i) > $o).
0.20/0.48	thf(decl_25, type, esk1_0: $i).
0.20/0.48	thf(decl_26, type, esk2_0: $i).
0.20/0.48	thf(cEXT_A_LEIB2, conjecture, (![X1:($i > $i) > $o]:(((X1 @ cN)<=>(X1 @ cM)))<=![X2:$i, X3:$i > $o]:(((X3 @ (cM @ X2))<=>(X3 @ (cN @ X2))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cEXT_A_LEIB2)).
0.20/0.48	thf(c_0_1, negated_conjecture, ~((![X2:$i, X3:$i > $o]:(((X3 @ (cM @ X2))<=>(X3 @ (cN @ X2))))=>![X1:($i > $i) > $o]:(((X1 @ cN)<=>(X1 @ cM))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cEXT_A_LEIB2])])).
0.20/0.48	thf(c_0_2, negated_conjecture, ![X7:$i, X8:$i > $o]:((((~(X8 @ (cM @ X7))|(X8 @ (cN @ X7)))&(~(X8 @ (cN @ X7))|(X8 @ (cM @ X7))))&((~(epred1_0 @ cN)|~(epred1_0 @ cM))&((epred1_0 @ cN)|(epred1_0 @ cM))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])).
0.20/0.48	thf(c_0_3, negated_conjecture, ((epred1_0 @ cN)|(epred1_0 @ cM)), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.48	thf(c_0_4, negated_conjecture, (~((epred1_0 @ cN))|~((epred1_0 @ cM))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.48	thf(c_0_5, plain, ((epred1_0 @ cM)|((cN)!=(cM))), inference(ext_eqfact,[status(thm)],[c_0_3])).
0.20/0.48	thf(c_0_6, plain, ((cN)!=(cM)), inference(csr,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_4, c_0_5]), c_0_5])).
0.20/0.48	thf(c_0_7, negated_conjecture, ![X3:$i > $o, X2:$i]:(((X3 @ (cN @ X2))|~((X3 @ (cM @ X2))))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.20/0.48	thf(c_0_8, plain, ((cN @ esk2_0)!=(cM @ esk2_0)), inference(neg_ext,[status(thm)],[c_0_6])).
0.20/0.48	thf(c_0_9, negated_conjecture, ![X2:$i]:(((cN @ X2)=(cM @ X2))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_7])).
0.20/0.48	thf(c_0_10, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8, c_0_9])]), ['proof']).
0.20/0.48	# SZS output end CNFRefutation
0.20/0.48	# Parsed axioms                        : 3
0.20/0.48	# Removed by relevancy pruning/SinE    : 0
0.20/0.48	# Initial clauses                      : 6
0.20/0.48	# Removed in clause preprocessing      : 2
0.20/0.48	# Initial clauses in saturation        : 4
0.20/0.48	# Processed clauses                    : 15
0.20/0.48	# ...of these trivial                  : 2
0.20/0.48	# ...subsumed                          : 1
0.20/0.48	# ...remaining for further processing  : 12
0.20/0.48	# Other redundant clauses eliminated   : 0
0.20/0.48	# Clauses deleted for lack of memory   : 0
0.20/0.48	# Backward-subsumed                    : 1
0.20/0.48	# Backward-rewritten                   : 3
0.20/0.48	# Generated clauses                    : 13
0.20/0.48	# ...of the previous two non-redundant : 10
0.20/0.48	# ...aggressively subsumed             : 0
0.20/0.48	# Contextual simplify-reflections      : 1
0.20/0.48	# Paramodulations                      : 1
0.20/0.48	# Factorizations                       : 0
0.20/0.48	# NegExts                              : 2
0.20/0.48	# Equation resolutions                 : 0
0.20/0.48	# Propositional unsat checks           : 0
0.20/0.48	#    Propositional check models        : 0
0.20/0.48	#    Propositional check unsatisfiable : 0
0.20/0.48	#    Propositional clauses             : 0
0.20/0.48	#    Propositional clauses after purity: 0
0.20/0.48	#    Propositional unsat core size     : 0
0.20/0.48	#    Propositional preprocessing time  : 0.000
0.20/0.48	#    Propositional encoding time       : 0.000
0.20/0.48	#    Propositional solver time         : 0.000
0.20/0.48	#    Success case prop preproc time    : 0.000
0.20/0.48	#    Success case prop encoding time   : 0.000
0.20/0.48	#    Success case prop solver time     : 0.000
0.20/0.48	# Current number of processed clauses  : 4
0.20/0.48	#    Positive orientable unit clauses  : 1
0.20/0.48	#    Positive unorientable unit clauses: 0
0.20/0.48	#    Negative unit clauses             : 1
0.20/0.48	#    Non-unit-clauses                  : 2
0.20/0.48	# Current number of unprocessed clauses: 2
0.20/0.48	# ...number of literals in the above   : 3
0.20/0.48	# Current number of archived formulas  : 0
0.20/0.48	# Current number of archived clauses   : 8
0.20/0.48	# Clause-clause subsumption calls (NU) : 1
0.20/0.48	# Rec. Clause-clause subsumption calls : 1
0.20/0.48	# Non-unit clause-clause subsumptions  : 1
0.20/0.48	# Unit Clause-clause subsumption calls : 5
0.20/0.48	# Rewrite failures with RHS unbound    : 0
0.20/0.48	# BW rewrite match attempts            : 4
0.20/0.48	# BW rewrite match successes           : 3
0.20/0.48	# Condensation attempts                : 0
0.20/0.48	# Condensation successes               : 0
0.20/0.48	# Termbank termtop insertions          : 471
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.003 s
0.20/0.48	# System time              : 0.002 s
0.20/0.48	# Total time               : 0.005 s
0.20/0.48	# Maximum resident set size: 1760 pages
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.004 s
0.20/0.48	# System time              : 0.004 s
0.20/0.48	# Total time               : 0.008 s
0.20/0.48	# Maximum resident set size: 1724 pages
0.20/0.48	EOF